Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q)

Plus BROWSE SEARCH IEEE XPLORE GUIDE View TOC | Previous Article | Next Article Analysis of one-dimensional linear hybrid cellular automa Cattell, K. Muzio, J.C. Dept. of Comput. Sci., Victoria Univ., BC; This paper appears in: Computers, IEEE Transactions on Publication Date: Jul 1996 Volume: 45, Issue: 7 On page(s): 782-792 ISSN: 0018-9340 References Cited: 22 CODEN: ITCOB4 INSPEC Accession Number: 5349483 Digital Object Identifier: 10.1109/12.508317 Posted online: 2002-08-06 20:28:15.0 Abstract The paper studies theoretical aspects of one dimensional linear hybrid cellular automata field. General results concerning the characteristic polynomials of such automata are pre synthesis algorithm for determining such a linear hybrid cellular automaton with a specific polynomial is given, along with empirical results and a theoretical analysis. Cyclic bounda are defined and related to the more common null boundary cellular automate. An explicit between a cellular automaton and its corresponding linear feedback shift register is derivThe paper studies theoretical aspects of one dimensional linear hybrid cellular automata field. General results concerning the characteristic polynomials of such automata are pre synthesis algorithm for determining such a linear hybrid cellular automaton with a specific polynomial is given, along with empirical results and a theoretical analysis. Cyclic bounda are defined and related to the more common null boundary cellular automate. An explicit between a cellular automaton and its corresponding linear feedback shift register is deriv Index Terms Inspec Controlled Indexing Galois fields cellular automata polynomials Non-controlled Indexing characteristic polynomial characteristic polynomials common null boundary ce automata cyclic boundary cellular automata finite Galois field linear feedback one dimensional linear hybrid cellular automata probabilistic synthesis algorithm analysis theoretical aspects Author